SEPIA: Search for Proofs Using Inferred Automata

نویسندگان

  • Thomas Gransden
  • Neil Walkinshaw
  • Rajeev Raman
چکیده

This paper describes SEPIA, a tool for automated proof generation in Coq. SEPIA combines model inference with interactive theorem proving. Existing proof corpora are modelled using state-based models inferred from tactic sequences. These can then be traversed automatically to identify proofs. The SEPIA system is described and its performance evaluated on three Coq datasets. Our results show that SEPIA provides a useful complement to existing automated tactics in Coq.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining SEPIA and ML4PG

SEPIA is an approach that infers state based models from existing proof corpora. These models can then be used for the development of new proofs. As with similar approaches, selecting the best facts to use in new proofs is challenging. We investigate the potential use of ML4PG as a relevance filter for our approach achieving a model only inferred from the lemma suggestions by ML4PG. These reduc...

متن کامل

Novel efficient fault-tolerant full-adder for quantum-dot cellular automata

Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for semiconductor transistor based technologies. A novel fault-tolerant QCA full-adder cell is proposed: This component is simple in structure and suitable for designing fault-tolerant QCA circuits. The redundant version of QCA full-adder cell is powerful in terms of implementing robust digital functions. ...

متن کامل

Towards Completeness via Proof Search in the Linear Time mu-Calculus

Modal μ-calculus is one of the central languages of logic and verification, whose study involves notoriously complex objects: automata over infinite structures on the model-theoretical side; infinite proofs and proofs by (co)induction on the proof-theoretical side. Nevertheless, axiomatizations have been given for both linear and branching time μ-calculi, with quite involved completeness argume...

متن کامل

Novel efficient fault-tolerant full-adder for quantum-dot cellular automata

Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for semiconductor transistor based technologies. A novel fault-tolerant QCA full-adder cell is proposed: This component is simple in structure and suitable for designing fault-tolerant QCA circuits. The redundant version of QCA full-adder cell is powerful in terms of implementing robust digital functions. ...

متن کامل

Urban Growth Modeling using Integrated Cellular Automata and Gravitational Search Algorithm (Case Study: Shiraz City, Iran)

Cities are growing and encountering many changes over time due to population growth and migration. Identification and detection of these changes play important roles in urban management and sustainable development. Urban growth models are divided into two main categories: first cellular models which are further divided into experimental, dynamic, and integrated models and second vector models. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015